Smoothing iterative block methods for linear systems with multiple right-hand sides
نویسندگان
چکیده
منابع مشابه
Smoothing iterative block methods for linear systems with multiple right-hand sides
In the present paper, we present smoothing procedures for iterative block methods for solving nonsymmetric linear systems of equations with multiple right-hand sides. These procedures generalize those known when solving one right-hand linear systems. We give some properties of these new methods and then, using these procedures we show connections between some known iterative block methods. Fina...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملthe block lsmr algorithm for solving linear systems with multiple right-hand sides
lsmr (least squares minimal residual) is an iterative method for the solution of the linear system of equations and leastsquares problems. this paper presents a block version of the lsmr algorithm for solving linear systems with multiple right-hand sides. the new algorithm is based on the block bidiagonalization and derived by minimizing the frobenius norm of the resid ual matrix of normal equa...
متن کاملBlock Bidiagonalization Methods for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides
Many applications require the solution of large nonsymmetric linear systems with multiple right-hand sides. Instead of applying an iterative method to each of these systems individually, it is often more eecient to use a block version of the method that generates iterates for all the systems simultaneously. In this paper, we propose block versions of Galerkin/minimal residual pair of bidiagonal...
متن کاملBlock Krylov Space Methods for Linear Systems with Multiple Right-hand Sides: an Introduction
In a number of applications in scientific computing and engineering one has to solve huge sparse linear systems of equations with several right-hand sides that are given at once. Block Krylov space solvers are iterative methods that are especially designed for such problems and have fundamental advantages over the corresponding methods for systems with a single right-hand side: much larger sear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1999
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(99)00083-7